Interruptible algorithms for multiproblem solving

Interruptible Algorithms for Multi-Problem Solving

In this paper we address the problem of designing an interruptible system in a setting in which n problem instances, all equally important, must be solved. The system involves scheduling executions of contract algorithms (which offer a tradeoff between allowable computation time and quality of the solution) in m identical parallel processors. When an interruption occurs, the system must report ...

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

Run-Time Monitoring of Fixed-Contract Interruptible Algorithms

Anytime algorithms give intelligent real-time systems the ability to trade deliberation time for quality of results. This capability is essential in domains where computing the optimal result is not computationally feasible or is not economically desirable. Examples of such domains include avionics, air traffic control, process control and missioncritical computations. Run-time monitoring of an...

Algorithms for Solving Equations

The main goal of this work is an attempt to understand the efficiency of algorithms for solving systems of equations. For example, consider a map / from complex Cartesian space C n to C n given by polynomials. How fast can one find good approximations to one or all of the zeros of / ? However, for clarity of exposition and development we will usually swing from one extreme to another about this...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.